A Polynomial-time Algorithm for Deciding Equivalence of Normed Context-free Processes

نویسندگان

  • Yoram Hirshfeld
  • Mark Jerrum
  • Faron Moller
چکیده

A polynomial-time procedure is presented for deciding bisimilarity of normed context-free processes. It follows as a corollary that language equivalence of simple context-free grammars is decidable in polynomial time.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free Processes

The previous best upper bound on the complexity of deciding bisimilarity between normed context-free processes is due to Huynh and Tian (1994), who put the problem in Z; = NPNP: their algorithm guesses a proof of equivalence and validates this proof in polynomial time using oracles freely answering questions which are in NP. In this paper we improve on this result by describing a polynomial-tim...

متن کامل

Decidability of Bisimulation Equivalence of Context-free Processes Extends to Processes Deened over Bpa

In CHS92] was proved that (strong) bisimulation equivalence is de-cidable for all context-free processes. We reduce eeectively the question of bisimulation equivalence of processes in BPA to that of context-free processes, by interpreting the deadlocking process as a process which iterates a fresh action forever. This shows that bisimulation is also decidable for BPA. 1 Introduction In BBK87, B...

متن کامل

Fast equivalence-checking for normed context-free processes

Bisimulation equivalence is decidable in polynomial time over normed graphs generated by a context-free grammar. We present a new algorithm, working in time O(n5), thus improving the previously known complexity O(n8polylog(n)). It also improves the previously known complexity O(n6polylog(n)) of the equality problem for simple grammars. Digital Object Identifier 10.4230/LIPIcs.FSTTCS.2010.1

متن کامل

A Polynomial-Time Algorithm for Deciding Bisimulation Equivalence of Normed Basic Parallel Processes

A polynomial-time algorithm is presented for deciding bisimulation equivalence of so-called Basic Parallel Processes: multisets of elementary processes combined by a commutative parallel-composition operator. 1 Discussion Consider a collection (actually a multiset) of \elementary processes," each of a nite number of diierent kinds. At any instant, one of the elementary processes may spontaneous...

متن کامل

Computational Complexity of Some Equivalence-Checking Problems

This habilitation thesis gives an overview of five papers of the author in the area of verification, in particular, in the study of computational complexity of equivalence checking problems and related areas. The first of these papers, Sawa, Jančar: Equivalences on Finite-State Systems are PTIME-hard (2005), shows that deciding any relation between bisimulation equivalence (bisimilarity) and tr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994